Isomorphisms of cyclic combinatorial objects
نویسندگان
چکیده
منابع مشابه
On the Automorphism Groups and Equivalence of Cyclic Combinatorial Objects
We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial objects on p elements are equivalent.
متن کاملConstruction of Combinatorial Objects
Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classiied. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, using an algorithmic version of Burnside's table of marks, computing double coset representatives, a...
متن کاملIsomorphisms of Some Cyclic Abelian Covers of Symmetric Digraphs
$D$ if $D^{j}$ is a g-cyclic A-cover of $D$ for some $g\in A$ . In the case that $A$ is abelian, . then $D_{g}(\alpha)$ is simply called a cyclic abelian cover. Let $\alpha$ and $\beta$ be two alternating functions $homA(D)$ into $A$ , and let $\Gamma$ be a subgroup of the automorphism group Aut $D$ of $D$ , denoted $\Gamma\leq$ Aut $D$ . Let $g,$ $h\in A$ . Then two cyclic A-covers $D_{g}(\alp...
متن کاملIsomorphisms of Direct Products of Finite Cyclic Groups
In this article, we formalize that every finite cyclic group is isomorphic to a direct product of finite cyclic groups which orders are relative prime. This theorem is closely related to the Chinese Remainder theorem ([18]) and is a useful lemma to prove the basis theorem for finite abelian groups and the fundamental theorem of finite abelian groups. Moreover, we formalize some facts about the ...
متن کاملFast Enumeration of Combinatorial Objects
The problem of ranking (or perfect hashing) is well known in Combinatorial Analysis, Computer Science, and Information Theory. There are widely used methods for ranking permutations of numbers {1, 2, ..., n}, n ≥ 1, for ranking binary words of length n with a fixed number of ones and for many other combinatorial problems. Many of these methods have nonexponential memory size and the time of enu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90162-3